منابع مشابه
Facial Texture Coding at Low Bit Rates
This paper treats the topic of how to eeciently represent facial textures, for model based coding of human face images. The scheme is based on the Karhunen-Lo eve transform and involves an elaborate normalization process that enhances PSNR with around 0.5 dB compared to normalization with scaling, translation and rotation. It also seems to augment the perceived visual quality. Furthermore, a bl...
متن کاملFacial Texture Coding at Very Low Bit
| This paper treats the topic of how to eeciently represent facial textures, for model based coding of human face images. The scheme is based on the Karhunen-Lo eve transform and involves an elaborate normalization process that enhances PSNR with around 0.5 dB compared to normalization with scaling, translation and rotation. It also seems to augment the perceived visual quality. Furthermore , a...
متن کاملRandom Sparse Bit Strings at the Threshold of Adjacency
(where Un, c √ n is the random bit string of length n) is infinitely differentiable. Our methodology for showing this is in itself interesting. We begin with finite models, go to the infinite (via the almost sure theories) and then characterize fφ(c) as an infinite sum of products of polynomials and exponentials. We further show that if a sentence φ has limiting probability 1 for some c, then φ...
متن کاملImplementing Pairings at the 192-Bit Security Level
We implement asymmetric pairings derived from KachisaSchaefer-Scott (KSS), Barreto-Naehrig (BN), and Barreto-Lynn-Scott (BLS) elliptic curves at the 192-bit security level. Somewhat surprisingly, we find pairings derived from BLS curves with embedding degree 12 to be the fastest for our serial as well as our parallel implementations. Our serial implementations provide a factor-3 speedup over th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2007
ISSN: 0028-0836,1476-4687
DOI: 10.1038/448544a